The continuous d-step conjecture for polytopes
نویسندگان
چکیده
The curvature of a polytope, deflned as the largest possible total curvature of the associated central path, can be regarded as the continuous analogue of its diameter. We prove the analogue of the result of Klee and Walkup. Namely, we show that if the order of the curvature is less than the dimension d for all polytope deflned by 2d inequalities and for all d, then the order of the curvature is less that the number of inequalities for all polytopes.
منابع مشابه
A Continuous d -Step Conjecture for Polytopes
The curvature of a polytope, defined as the largest possible total curvature of the associated central path, can be regarded as a continuous analogue of its diameter. We prove an analogue of the result of Klee and Walkup. Namely, we show that if the order of the curvature is less than the dimension d for all polytopes defined by 2d inequalities and for all d , then the order of the curvature is...
متن کاملEdge-Graph Diameter Bounds for Convex Polytopes with Few Facets
We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d = 6. This implies that for all pairs (d, n) with n−d ≤ 6 the diameter of the edge graph of a d-polytope with n facets is bounded by 6, which proves the Hirsch conjecture for all n − d ≤ 6. We show this result by showing this boun...
متن کاملfor polytopes and its continuous analogue
Inspired by the d-step approach used for investigating the diameter of polytopes, the following d-step conjecture was introduced by Deza and Franek : the number of runs in a string of length n with d distinct symbols is at most n − d. Bannai et al. showed that the number of runs in a string is less than its length by mapping each run to a set of starting positions of Lyndon roots. We show that ...
متن کاملCombinatorial Polytope Enumeration
We describe a provably complete algorithm for the generation of a tight, possibly exact, superset of all combinatorially distinct simple n-facet polytopes in Rd, along with their graphs, f -vectors, and face lattices. The technique applies repeated cutting planes and planar sweeps to a d−simplex. Our generator has implications for several outstanding problems in polytope theory, including conje...
متن کاملMonotone paths on polytopes
We investigate the vertex-connectivity of the graph of f -monotone paths on a d-polytope P with respect to a generic functional f . The third author has conjectured that this graph is always (d − 1)-connected. We resolve this conjecture positively for simple polytopes and show that the graph is 2-connected for any d-polytope with d ≥ 3. However, we disprove the conjecture in general by exhibiti...
متن کامل